منابع مشابه
Some Notes on Property A
Introduction The coarse Baum-Connes conjecture states that a certain coarse assembly map µ : KX * (X) → K * (C * (X)) is an isomorphism (see for example [Roe96] or the piece by N. Higson and J. Roe in [FRR95]). It has many important consequences including one of the main motivations for this piece: a descent technique connects it to injectivity of the ('ordinary') Baum-Connes assembly map µ : K...
متن کاملNotes on Property - Preserving Encryption
The first type of specialized encryption scheme that can be used in secure outsourced storage we will look at is property-preserving encryption. This is encryption where some desired property of the plaintexts is intentionally leaked by the ciphertexts. The two main examples we will study are deterministic encryption, which preserves the equality property, and order preserving encryption, which...
متن کاملMore on rc-Lindelöf sets and almost rc-Lindelöf sets
A subset A of a space X is called regular open if A = IntA, and regular closed if X\A is regular open, or equivalently, if A= IntA. A is called semiopen [16] (resp., preopen [17], semi-preopen [3], b-open [4]) ifA⊂ IntA (resp.,A⊂ IntA,A⊂ IntA ,A⊂ IntA∪ IntA). The concept of a preopen set was introduced in [6] where the term locally dense was used and the concept of a semi-preopen set was introd...
متن کاملOn Productively Lindelöf Spaces
We study conditions on a topological space that guarantee that its product with every Lindelöf space is Lindelöf. The main tool is a condition discovered by K. Alster and we call spaces satisfying his condition Alster spaces. We also study some variations on scattered spaces that are relevant for this question.
متن کاملThree Notes on Distributed Property Testing
In this paper we present distributed property-testing algorithms for graph properties in the congest model, with emphasis on testing subgraph-freeness. Testing a graph property P means distinguishing graphs G = (V,E) having property P from graphs that are ε-far from having it, meaning that ε|E| edges must be added or removed from G to obtain a graph satisfying P. We present a series of results,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2009
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-009-0065-8